Approximate Spatial Query Processing using Raster Signatures
نویسندگان
چکیده
Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a query. On the other hand, in many cases it may be enough to the user to get a fast approximate answer, since it has the desired precision. The challenge to give to the user an exact query answer within a reasonable time becomes even bigger in the spatial database field. This work proposes the use of the Four Color Raster Signature (4CRS) for approximate query processing. The main goal is to reduce the time required to process a query executing it on approximate data (4CRS signature) instead of accessing the real datasets. The experimental tests demonstrated the good results of our proposal. Considering the test of the most important algorithm, the time required to process an approximate query answer has average of 7.22% of the time to get an exact answer, the disk accesses have average of 7.04% and the average error is 1% related to exact processing. Besides the 4CRS storage requirements are also quite small, which has an average of only 3.57% of the space required to store the real datasets.
منابع مشابه
Approximate Query Processing in Spatial Databases Using Raster Signatures
Traditional query processing provides exact answers to queries. However, in many applications, the response time of exact answers is often longer than what is acceptable. Approximate query processing has emerged as an alternative approach to give to the user an answer in a short time. The goal is to provide an estimated result in one order of magnitude less time than the time to compute the exa...
متن کاملProcessing Queries on Road Networks in Spatial Data Base Perspective for Selectivity Estimation
This work mainly focuses on building a framework that is capable of analyzing spatial approximate substring queries, for mainly to solve the selectivity estimation problem of range queries which belongs to road networks represented in spatial databases. The selectivity estimation is nothing but estimating the size of the results i.e., estimating the number of points that presents in a graph whi...
متن کاملSupporting Web-Based Visual Exploration of Large-Scale Raster Geospatial Data Using Binned Min-Max Quadtree
Traditionally environmental scientists are limited to simple display and animation of large-scale raster geospatial data derived from remote sensing instrumentation and model simulation outputs. Identifying regions that satisfy certain range criteria, e.g., temperature between [t1,t2) and precipitation between [p1,p2), plays an important role in query-driven visualization and visual exploration...
متن کاملGiS: Fast Indexing and Querying of Graph Structures
We propose a new way of indexing a large database of graphs and processing exact subgraph matching (or subgraph isomorphism) and approximate (full) graph matching queries. Rather that decomposing a graph into smaller units (e.g., paths, trees, graphs) for indexing purposes, we represent each graph in the database by its graph signature, which is essentially a multiset, and each signature is the...
متن کاملMultitemporal geospatial query grouping using correlation signatures
With recent advances in temporal and spatiotemporal databases, user demands are becoming more complex. As a result, simple queries are replaced by complex multitemporal query scenarios. In this paper we propose a novel image-based approach to temporally group together multidimensional geospatial queries. Correlation signatures act as a powerful raster mapping that visualizes multi-dimensional s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004